Algorithmics of Matching Under Preferences
نویسنده
چکیده
• Page 17, line 13: “constrast” −→ “contrast”. (Due to Mechthild Opperud.) • Page 21, line 17: “attributes” −→ “attributed”. • Page 21, lines -4 to -3: change “pairs in which either (i) ri is unassigned if she is unassigned in both M and M ′, or (ii)” to “pairs obtained as follows: for each resident ri, ri is unassigned if she is unassigned in both M and M ′, otherwise”. • Page 21, line -1: “join” −→ “meet”. (Due to Didac Busquets.) • Page 22, line 1: “meet” −→ “join”. (Due to Didac Busquets.) • Page 23, line 4: add “In an sm instance, any matching is automatically assumed to have size n.”
منابع مشابه
Stable Roommates Problem with Random Preferences
Matching under preferences is a topic of great practical importance, deep mathematical structure, and elegant algorithmics [Manlove 2013; Gusfield and Irving 1989]. The most famous example is the stable marriage problem, where n men and n women compete with each other in the “marriage market.” Each man ranks all the women according to his individual preferences, and each woman does the same wit...
متن کاملIdentifying customer preferences in using e-banking services
Clients are the vital artery of every industry and business. Maintaining these customers is one of the most important tasks of any business, especially banks. The specific needs of customers and the increasing compe- tition in the banking services market have led banks to create structures that can respond flexibly to these needs. Obviously, one of the important points is that moving to th...
متن کاملIdentifying customer preferences in using e-banking services
Clients are the vital artery of every industry and business. Maintaining these customers is one of the most important tasks of any business, especially banks. The specific needs of customers and the increasing compe- tition in the banking services market have led banks to create structures that can respond flexibly to these needs. Obviously, one of the important points is that moving to th...
متن کاملOn a Parallel-Algorithms Method for String Matching Problems
Suux trees are the main data-structure in string matching algorithmics. There are several serial algorithms for suux tree construction which run in linear time, but the number of operations in the only parallel algorithm available, due to Apostolico, Iliopoulos, Landau, Schieber and Vishkin, is proportional to n log n. The algorithm is based on labeling substrings, similar to a classical serial...
متن کامل